A search for good convolutional codes to be used in the construction of turbo codes
نویسندگان
چکیده
Recursive systematic convolutional encoders have been shown to play a crucial role in the design of turbo codes. We recall some properties of binary convolutional encoders and apply them to a search for good constituent convolutional codes of turbo codes. Tables of the “best” recursive systematic convolutional encoders found are presented for various rates, together with the average bit-error probability performances of some turbo codes using them.
منابع مشابه
An approach to fault detection and correction in design of systems using of Turbo codes
We present an approach to design of fault tolerant computing systems. In this paper, a technique is employed that enable the combination of several codes, in order to obtain flexibility in the design of error correcting codes. Code combining techniques are very effective, which one of these codes are turbo codes. The Algorithm-based fault tolerance techniques that to detect errors rely on the c...
متن کاملA Gallager-Tanner construction based on convolutional codes
Generalized low density codes are built by applying a Tanner-like construction to binary recursive systematic convolutional codes. The Gallager-Tanner construction is restricted to 2 levels only. We describe the structure of a GLD code and show how to compute its ensemble performance. We also prove that RSC based GLD codes are asymptotically good. A parity-check interpretation of turbo codes is...
متن کاملTurbo Lattices: Construction and Error Decoding Performance
In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Construction D to produce turbo lattices. This method needs a set of nested linear codes as its underlying structure. We benefit from turbo codes as our basis codes. Therefore, a set of nested turbo codes based on nested interleavers (block interleavers) and nested convolutional codes i...
متن کاملConstruction and Performance of q-ary Turbo Codes for use with M-ary Modulation Techniques
This paper describes a construction technique for q-ary Turbo Codes that computes good recursive systematic convolutional q-ary constituent codes with constraint length ν ≤ 5 for q = 2, m = 2 and 3. The construction technique, based on the algorithm in [5], determines the codes with maximum di for i = 2, 3, and 4 and minimum codeword multiplicity, where di is the minimum weight of all code sequ...
متن کاملTurbo Lattices: Construction and Performance Analysis
In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Construction D to produce turbo lattices. This method needs a set of nested linear codes as its underlying structure. We benefit from turbo codes as our basis codes. Therefore, a set of nested turbo codes based on nested interleavers and nested convolutional codes is built. To this end,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Communications
دوره 46 شماره
صفحات -
تاریخ انتشار 1998